On stability of invariant subspaces of commuting matrices
نویسندگان
چکیده
منابع مشابه
On a Perturbation Bound for Invariant Subspaces of Matrices
Given a nonsymmetric matrix A, we investigate the effect of perturbations on an invariant subspace of A. The result derived in this paper is less restrictive on the norm of the perturbation and provides a potentially tighter bound compared to Stewart’s classical result. Moreover, we provide norm estimates for the remainder terms in well-known perturbation expansions for invariant subspaces, eig...
متن کاملEla Invariant Neutral Subspaces for Hamiltonian Matrices
Hamiltonian matrices with respect to a nondegenerate skewsymmetric or skewhermitian indefinite inner product in finite dimensional real, complex, or quaternion vector spaces are studied. Subspaces that are simultaneously invariant for the matrices and neutral in the indefinite inner product are of special interest. The dimension of maximal (by inclusion) such subspaces is identified in terms of...
متن کاملInvariant neutral subspaces for Hamiltonian matrices
Hamiltonian matrices with respect to a nondegenerate skewsymmetric or skewhermitian indefinite inner product in finite dimensional real, complex, or quaternion vector spaces are studied. Subspaces that are simultaneously invariant for the matrices and neutral in the indefinite inner product are of special interest. The dimension of maximal (by inclusion) such subspaces is identified in terms of...
متن کاملPerturbation analysis of Lagrangian invariant subspaces of symplectic matrices
Lagrangian invariant subspaces for symplectic matrices play an important role in the numerical solution of discrete time, robust and optimal control problems. The sensitivity (perturbation) analysis of these subspaces, however, is a difficult problem, in particular, when the eigenvalues are on or close to some critical regions in the complex plane, such as the unit circle. We present a detailed...
متن کاملFast Parallelizable Methods for Computing Invariant Subspaces of Hermitian Matrices
We propose a quadratically convergent algorithm for computing the invariant subspaces of an Hermitian matrix. Each iteration of the algorithm consists of one matrix-matrix multiplication and one QR decomposition. We present an accurate convergence analysis of the algorithm without using the big O notation. We also propose a general framework based on implicit rational transformations which allo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2002
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(01)00442-6